Diierential Logic Programs: Programming Methodologies and Semantics
نویسندگان
چکیده
We introduce the notion of diierential logic programs and we deene an operator for composing them in a hierarchical fashion. The semantics of this composition operator is reminiscent the semantics of inheritance of the object oriented paradigm. Similarly to classes in that paradigm, diierential programs can be organized in isa schemas where each component inherits or redeenes, modifying them, the predicates deened in the components that are placed higher up in the schema. We demonstrate the use of this form of composition as a programming methodology that enhances reusability, code sharing and information hiding. We deene a proof theory and a model theory for the composition of diierential programs and we prove that the two theories coincide. We also deene a compositional and fully abstract semantics for diierential programs and we address the importance of this semantics as a formal tool for reasoning on the computational properties of diierential programs and their composition. A preliminary version of this paper appeared in 4].
منابع مشابه
Di erential Logic Programming
In this paper we deene a compositional semantics for a generalized composition operator on logic programs. Static and dynamic inheritance as well as composition by union of clauses can all be obtained by specializing the general operator. The semantics is based on the notion of diierential programs, logic programs annotated with declarations that establish the programs' external interfaces.
متن کاملDifferential Logic Programs: Programming Methodologies and Semantics
We introduce the notion of differential logic programs and we define an operator for composing themin a hierarchical fashion. The semantics of this composition operator is reminiscent the semantics ofinheritance of the object oriented paradigm. Similarly to classes in that paradigm, differential programscan be organized in isa schemas where each component inherits or redefines, modi...
متن کاملAn FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions
We introduce an answer-set semantics for abstract-constraint programs with disjunction in rule heads in the style of Faber, Leone, and Pfeifer (FLP). To this end, we extend the definition of an answer set for logic programs with aggregates in rule bodies using the usual FLP-reduct. Additionally, we also provide a characterisation of our semantics in terms of unfounded sets, likewise generalisin...
متن کاملTowards a unified theory of logic programming semantics: Level mapping characterizations of selector generated models
Currently, the variety of expressive extensions and different semantics created for logic programs with negation is diverse and heterogeneous, and there is a lack of comprehensive comparative studies which map out the multitude of perspectives in a uniform way. Most recently, however, new methodologies have been proposed which allow one to derive uniform characterizations of different declarati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007